Counting perfect matchings in n-extendable graphs
نویسنده
چکیده
The structural theory of matchings is used to establish lower bounds on the number of perfect matchings in n-extendable graphs. It is shown that any such graph on p vertices and q edges contains at least (n + 1)!/4[q − p − (n − 1)(2 − 3) + 4] different perfect matchings, where is the maximum degree of a vertex in G. © 2007 Elsevier B.V. All rights reserved. MSC: 05C70; 05C40; 05C75
منابع مشابه
Bipartite matching extendable graphs
Matching extendability is significant in graph theory and its applications. The basic notion in this direction is n-extendability introduced by Plummer in 1980. Motivated by the different natures of bipartite matchings and non-bipartite matchings, this paper investigates bipartite-matching extendable (BM-extendable) graphs. A graph G is said to be BM-extendable if every matching M which is a pe...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملCounting Matchings with k Unmatched Vertices in Planar Graphs
We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm [26, 33, 27], the problem of counting all matchings (possibly containing unmatched vertices, also known as defects) is known to be #P-complete on planar graphs [23]. To interpolate between the hard case of counting matchings and the eas...
متن کاملCounting perfect matchings in graphs that exclude a single-crossing minor
A graph H is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph H, we give an O(n4) time algorithm for counting perfect matchings in graphs excluding H as a minor. The runtime can be lowered to O(n1.5) when G excludes K5 or K3,3 as a minor. This is the first generalization of an algorithm for counting perfect matchings in K3,3free graphs (Li...
متن کاملOn lower bounds on the number of perfect matchings in n-extendable bricks
Using elements of the structural theory of matchings and a recently proved conjecture concerning bricks, it is shown that every n-extendable brick (except K4, C6 and the Petersen graph) with p vertices and q edges contains at least q − p + (n − 1)!! perfect matchings. If the girth of such an n-extendable brick is at least five, then this graph has at least q − p + nn−1 perfect matchings. As a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008